Ranking profiles of capability sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ranking profiles of capability sets

In this paper, we present an innovative approach for ranking profiles of capability sets on the basis of equity. An interesting way of capturing the notion of equity is to take into account the extent to which each of the different functioning vectors is shared by the population under consideration (of size n). This is done by defining the ‘common capability sets’ enjoyed by k individuals as th...

متن کامل

Ranking Sets of Objects

We provide a survey of the literature on ranking sets of objects. The interpretations of those set rankings include those employed in the theory of choice under complete uncertainty, rankings of opportunity sets, set rankings that appear in matching theory, and the structure of assembly preferences. The survey is prepared for the Handbook of Utility Theory, vol. 2, edited by Salvador Barberà, P...

متن کامل

Feature ranking in rough sets

We propose a novel feature ranking technique using discernibility matrix. Discernibility matrix is used in rough set theory for reduct computation. By making use of attribute frequency information in discernibility matrix, we develop a fast feature ranking mechanism. Based on the mechanism, two heuristic reduct computation algorithms are proposed. One is for optimal reduct and the other for app...

متن کامل

Link-based Ranking of Skyline Result Sets

Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multi-dimensional dataset. One of the major drawbacks of the skyline operator is the high cardinality of the result set. Providing the most interesting points of the skyline set (top-k) inherently involves the ranking of the skyline p...

متن کامل

Ranking sets of interacting objects via semivalues

In this paper, we address the problem of how to extend a ranking over single objects to another ranking over all possible collections of objects, taking into account the fact that objects grouped together can have mutual interaction. An answer to this issue is provided by using game theory and, specifically, the fact that an extension (i.e., a total proorder on the set of all subsets of objects...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Choice and Welfare

سال: 2008

ISSN: 0176-1714,1432-217X

DOI: 10.1007/s00355-007-0294-4